Nash equilibrium as a tool for the Car Sequencing Problem 4.0

Abstract This paper introduces a new concept to solve car sequencing problem called the Car Sequencing Problem 4.0, focuses paint shop. The of effective in shop is caused by specifics production process itself and structure line. cars as required painting justified economically. main goal minimize number costly changeovers guns because color changes synchronize those with periodic cleanings, forced technological requirements. For this purpose, buffer located applied. In game theoretic framework presented analyze problem. Three games are introduced: Buffer Slot Assignment Game–Buffer-OutShuttle Game BSAG-BOSG, In–Out Shuttle its modification modified Game. Based on simulations performed efficiency algorithms verified using several datasets.